Relationships between NP-sets, Co-NP-sets, and P-sets relative to random oracles
نویسنده
چکیده
In the present paper we prove that relative to random oracle A (with respect to the uniform measure) the following three assertions hold: (1) there is a pair of disjoint NP A-sets which are separable by no P A-set, (2) there is a pair of disjoint Co-NP A-sets which are separable by no P A-set and (3) there is an innnite Co-NP A-set having no innnite NP A-subset
منابع مشابه
A General Method to Construct Oracles Realizing Given Relationships Between Complexity Classes
We present a method to prove oracle theorems of the following type. The method provides a general framework for constructing an oracle A such that K A 2i?1 6 = K A 2i for i = 1; : : : ; n and L A 2j?1 6 = L A 2j for j = 1; : : : ; m. Using that method we obtain several results of this kind. The hardest of them is the existence of an oracle A such that P A 6 = NP A , P A = BPP A and both Co-NP A...
متن کاملNP - sets are Co - NP - immune Relative to aRandom
We prove that the class NP has Co-NP-immune sets relative to a random oracle. Moreover, we prove that, relative to a random oracle, there are L 2 P and NP-set L 1 L such that L 1 is Co-NP-immune and L n L 1 is NP-immune. The second theorem implies the theorem in 4] that Co-NP has NP-immune sets relative to a random oracle.
متن کاملNP - sets are Co - NP - immune Relative to a
We prove that the class NP has Co-NP-immune sets and the class Co-NP has NP-immune sets relative to a random oracle.
متن کاملDisjoint NP - Pairs ( Extended
We study the question of whether the class D of disjoint pairs (A,B) of NP-sets contains a complete pair. The question relates to the question of whether optimal proof systems exist, and we relate it to the previously studied question of whether there exists a disjoint pair of NP-sets that is NP-hard. We show under reasonable hypotheses that nonsymmetric disjoint NP-pairs exist, which provides ...
متن کاملStrong Reductions and Isomorphism of Complete Sets
We study the structure of the polynomial-time complete sets for NP and PSPACE under strong nondeterministic polynomial-time reductions (SNP-reductions). We show the following results. • If NP contains a p-random language, then all polynomial-time complete sets for PSPACE are SNP-isomorphic. • If NP ∩ co-NP contains a p-random language, then all polynomial-time complete sets for NP are SNP-isomo...
متن کامل